Theorem for an Inverse Problem
نویسنده
چکیده
Let VZu+k2u+k2a~(z)u+V.(a~(~)Vu) = -6(cc-y) inR3, where al(z) EL’(D), a&) E H’(D), D E R3_ = {z : 13 < 0) is a finite region, aj(Z) = 0 outside of D, j = 1,2, 1 + 02 > 0, al = El. Assume that thedatau(l,y,k),V~,yEP={I:13=0}8ndallkE(O,ko),ko>O is an arbitrary small number, are given. THEOREM. The above data determine aj(z), j = 1,2, uniquely.
منابع مشابه
A Uniqueness Theorem of the Solution of an Inverse Spectral Problem
This paper is devoted to the proof of the unique solvability ofthe inverse problems for second-order differential operators withregular singularities. It is shown that the potential functioncan be determined from spectral data, also we prove a uniquenesstheorem in the inverse problem.
متن کاملThe uniqueness theorem for inverse nodal problems with a chemical potential
In this paper, an inverse nodal problem for a second-order differential equation having a chemical potential on a finite interval is investigated. First, we estimate the nodal points and nodal lengths of differential operator. Then, we show that the potential can be uniquely determined by a dense set of nodes of the eigenfunctions.
متن کاملThe use of inverse quadratic radial basis functions for the solution of an inverse heat problem
In this paper, a numerical procedure for an inverse problem of simultaneously determining an unknown coefficient in a semilinear parabolic equation subject to the specification of the solution at an internal point along with the usual initial boundary conditions is considered. The method consists of expanding the required approximate solution as the elements of the inverse quadrati...
متن کاملPresentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem
The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001